/*
 *  Copyright (c) 2001-2007, Jean Tessier
 *  All rights reserved.
 *  
 *  Redistribution and use in source and binary forms, with or without
 *  modification, are permitted provided that the following conditions
 *  are met:
 *  
 *      * Redistributions of source code must retain the above copyright
 *        notice, this list of conditions and the following disclaimer.
 *  
 *      * Redistributions in binary form must reproduce the above copyright
 *        notice, this list of conditions and the following disclaimer in the
 *        documentation and/or other materials provided with the distribution.
 *  
 *      * Neither the name of Jean Tessier nor the names of his contributors
 *        may be used to endorse or promote products derived from this software
 *        without specific prior written permission.
 *  
 *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
 *  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
 *  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
 *  A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR
 *  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 *  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 *  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
 *  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
 *  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
 *  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 *  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */

package com.jeantessier.metrics;

import java.util.*;

public class WordCounter {
    public int countPackageName(String packageName) {
        return new StringTokenizer(packageName, ".").countTokens();
    }

    public int countIdentifier(String identifier) {
        int result = 0;

        int pos = identifier.lastIndexOf("$");
        identifier = identifier.substring(pos + 1);

        switch (identifier.length()) {
            case 0:
                // Do nothing
                break;
            case 1:
                result = 1;
                break;
            default:
                result = 1;
                int p1 = 0;
                int p2 = 1;
                while (p2 < identifier.length()) {
                    char ch1 = identifier.charAt(p1);
                    char ch2 = identifier.charAt(p2);
                    if (isBeginWordTransition(ch1, ch2)) {
                        if (p2 - p1 > 1) {
                            result++;
                        }
                        p1 = p2;
                    } else {
                        if (isEndWordTransition(ch1, ch2)) {
                            result++;
                        }
                        if (!isUpperCase(ch1)) {
                            p1++;
                        }
                    }
                    p2++;
                }
                break;
        }

        return result;
    }

    private boolean isBeginWordTransition(char ch1, char ch2) {
        return (isUpperCase(ch1) && !isUpperCase(ch2)) ||
                (ch1 == '_' && isUpperCase(ch2));
    }

    private boolean isEndWordTransition(char ch1, char ch2) {
        return (!isUpperCase(ch1) && isUpperCase(ch2)) ||
                (isUpperCase(ch1) && ch2 == '_');
    }

    private boolean isUpperCase(char ch) {
        return Character.isLetterOrDigit(ch) && Character.isUpperCase(ch);
    }
}
